import java.util.HashMap;
import java.util.Scanner;

/**
 * Created with IDEA
 * author:ju bai
 * Date:2021/7/2
 * Time:21:07
 **/
public class Main {
    /**
     * 分别统计A、B中的字符个数，遍历B中的每一个字符
     * A是否包含且个数是否>=1
     */
    public static void main(String[] args) {
        String strA;
        String strB;
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()){
            strA = sc.nextLine();
            strB = sc.nextLine();
            HashMap<Character,Integer> mapA = new HashMap<>();
            HashMap<Character,Integer> mapB = new HashMap<>();
            char[] arrA = strA.toCharArray();
            char[] arrB = strB.toCharArray();

            //统计字符串A出现的次数
            for (char ch:arrA) {
                //如果包含，个数+1
                if(mapA.containsKey(ch)){
                    mapA.put(ch,mapA.get(ch)+1);
                }else{//不包含，置个数为1
                    mapA.put(ch,1);
                }
            }
            //统计字符串B出现的次数
            for (char ch:arrB) {
                //如果包含，个数+1
                if(mapB.containsKey(ch)){
                    mapB.put(ch,mapB.get(ch)+1);
                }else{//不包含，置个数为1
                    mapB.put(ch,1);
                }
            }

            //遍历字符串B
            //判断B中的字符是否在A中出现
            boolean ret = true;
            for (char ch : arrB) {
                if(!mapA.containsKey(ch)||mapA.get(ch)<mapB.get(ch)) {
                    ret = false;
                    break;
                }
            }
            //最终判断
            if (ret) {
                System.out.println("Yes");
            }else{
                System.out.println("No");
            }
        }
    }
}
